package search.bst;

public class BstNode {
    private int data;
    private BstNode leftTree;
    private BstNode rightTree;


    public BstNode() {
    }

    public BstNode(int data) {
        this.data = data;
    }

    public BstNode(int data, BstNode leftTree, BstNode rightTree) {
        this.data = data;
        this.leftTree = leftTree;
        this.rightTree = rightTree;
    }

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public BstNode getLeftTree() {
        return leftTree;
    }

    public void setLeftTree(BstNode leftTree) {
        this.leftTree = leftTree;
    }

    public BstNode getRightTree() {
        return rightTree;
    }

    public void setRightTree(BstNode rightTree) {
        this.rightTree = rightTree;
    }
}
